Lossless Message Compression: Improving Throughput and Network Load

نویسندگان

  • Stefan Karlsson
  • Erik Hansson
چکیده

Upgrading the network infrastructure to increase the available bandwidth can be expensive and time consuming. In this paper we investigated whether applying compression to inter-process communication (IPC) messages, in order to increase the effective throughput of an existing network, can be beneficial or not. A literature study on lossless compression was used to select a few algorithms to be integrated into LINX, an IPC technology, as an extra layer to support lossless message compression. The testing involved sending messages, with real telecom data, between two nodes on a dedicated network with different network configurations and message sizes. To calculate the effective throughput for each algorithm, the round-trip time was measured. The conclusion was that the algorithms with the highest rate of compression yielded the best results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lossless Message Compression Bachelor Thesis in Computer Science

In this thesis we investigated whether using compression when sending inter-process communication (IPC) messages can be beneficial or not. A literature study on lossless compression resulted in a compilation of algorithms and techniques. Using this compilation, the algorithms LZO, LZFX, LZW, LZMA, bzip2 and LZ4 were selected to be integrated into LINX as an extra layer to support lossless messa...

متن کامل

An Enhanced Handoff Mechanism for Cellular IP

Handoff is one of the most important factors that may degrade the performance of TCP connections in wireless data networks. In this paper, we present a lossless and duplication free handoff scheme called LPM (Last Packet Marking) for improving Cellular IP semisoft handoff. LPM signals the safe handoff cue by sending a specially marked packet to mobile hosts. With this control packet, MH can ada...

متن کامل

Prediction-Capable Data Compression Algorithms for Improving Transmission Efficiency on Distributed Systems

Network bandwidth is a kind of limited and precious resources in modern distributed computing environments. Insufficient bandwidth will severely degrade the performance of a distributed computing task in exchanging massive data among the networked hosts. A feasible solution to save bandwidth is to incorporate data compression during transmission. However, blind, or unconditional, compression ma...

متن کامل

Secure and Compressed Secret Writing using DES and DEFLATE algorithm

A new secret writing using DES and DEFLATE algorithm is explored by improving the previous attempts in this sense in terms of security and compression. A Matching Pursuit algorithm using redundant basis decomposition technique is used to securely hide a message. The stability and computational complexity problems are solved by introducing new selection and update rules working entirely in the i...

متن کامل

An Analysis of Deflection-Based Wormhole Routing with Virtual Channels

We analyze a new wormhole routing scheme, which we call the wormhole deflection with virtual channels (abbreviated WDVC) scheme, that combines wormhole routing with virtual channels and deflection routing to provide efficient lossless communication. We use new analytical models to analyze the performance of the WDVC scheme for the Manhattan Street (MS) network topology. In particular, we examin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013